cover
Contact Name
Imam Much Ibnu Subroto
Contact Email
imam@unissula.ac.id
Phone
-
Journal Mail Official
ijai@iaesjournal.com
Editorial Address
-
Location
Kota yogyakarta,
Daerah istimewa yogyakarta
INDONESIA
IAES International Journal of Artificial Intelligence (IJ-AI)
ISSN : 20894872     EISSN : 22528938     DOI : -
IAES International Journal of Artificial Intelligence (IJ-AI) publishes articles in the field of artificial intelligence (AI). The scope covers all artificial intelligence area and its application in the following topics: neural networks; fuzzy logic; simulated biological evolution algorithms (like genetic algorithm, ant colony optimization, etc); reasoning and evolution; intelligence applications; computer vision and speech understanding; multimedia and cognitive informatics, data mining and machine learning tools, heuristic and AI planning strategies and tools, computational theories of learning; technology and computing (like particle swarm optimization); intelligent system architectures; knowledge representation; bioinformatics; natural language processing; multiagent systems; etc.
Arjuna Subject : -
Articles 5 Documents
Search results for , issue "Vol 6, No 3: September 2017" : 5 Documents clear
Firefly Algorithm Solution to Improving Threshold Distributed Energy Efficient Clustering Algorithm for Heterogeneous Wireless Sensor Networks Baghouri Mostafa; Chakkor Saad; Hajraoui Abderrahmane
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 6, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1406.579 KB) | DOI: 10.11591/ijai.v6.i3.pp91-99

Abstract

The improvement of the lifetime of heterogeneous wireless sensor networks is a challenge for many researches. One of the most important protocols to achieve this goal is to divide the network into clusters that run by a single node called cluster head and the others have attached. However, all nodes must form the cluster including the nearest nodes to the base station which should be excluded from the clustering process. Furthermore these nodes consume more energy since each member node communicates directly with their cluster head and not with the base station. To eliminate these notes from cluster process, we need to formulate a new energy total of the network which depends on the number of these nodes. In this paper we propose a new technic to optimize this energy which basing on the firefly algorithm. The developed approach allows the boundary of the excluded nodes efficiently. Computer simulation in MATLAB proves the superiority of this method concerning the increase of the lifetime and the number of the received packet messages compared to the others protocols.
Multi-Operator Genetic Algorithm for Dynamic Optimization Problems Al-khafaji Amen
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 6, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (399.186 KB) | DOI: 10.11591/ijai.v6.i3.pp139-142

Abstract

Maintaining population diversity is the most notable challenge in solving dynamic optimization problems (DOPs). Therefore, the objective of an efficient dynamic optimization algorithm is to track the optimum in these uncertain environments, and to locate the best solution. In this work, we propose a framework that is based on multi operators embedded in genetic algorithms (GA) and these operators are heuristic and arithmetic crossovers operators. The rationale behind this is to address the convergence problem and to maintain the diversity. The performance of the proposed framework is tested on the well-known dynamic optimization functions i.e., OneMax, Plateau, Royal Road and Deceptive. Empirical results show the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.
An Approch based on Genetic Algorithm for Multi-tenant Resource Allocation in SaaS Applications Elaheh kheiri; Mostafa Ghobaei Arani; Alireza Taghizadeh
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 6, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1204.996 KB) | DOI: 10.11591/ijai.v6.i3.pp124-138

Abstract

In recent years, the use of cloud services has been significantly expanded. The providers of software as a service employ multi-tenant architectures to deliver services to their users. In these multi-tenant applications the resource allocation would suffer from over-utilization or under-utilization issues. Considering the significant effects of resource allocation on the service performance and cost, in this paper we have proposed an approach based on genetic algorithm for resource allocation which guarantees service quality through providing adequate resources. The proposed approach also improves system performance, meets the requirements of users and provides maximum resource efficiency. Simulation results show that the proposed approach has better response rate and availability comparing to other approaches, while provides an efficient resource usage.
Is Parameters Quantification in Genetic Algorithm Important, How to do it? Hari Mohan Pandey
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 6, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (513.903 KB) | DOI: 10.11591/ijai.v6.i3.pp112-123

Abstract

The term “appropriate parameters” signifies the correct choice of values has considerable effect on the performance that directs the search process towards the global optima. The performance typically is measured considering both quality of the results obtained and time requires in finding them. A genetic algorithm is a search and optimization technique, whose performance largely depends on various factors – if not tuned appropriately, difficult to get global optima. This paper describes the applicability of orthogonal array and Taguchi approach in tuning the genetic algorithm parameters. The domain of inquiry is grammatical inference has a wide range of applications. The optimal conditions were obtained corresponding to performance and the quality of results with reduced cost and variability. The primary objective of conducting this study is to identify the appropriate parameter setting by which overall performance and quality of results can be enhanced. In addition, a systematic discussion presented will be helpful for researchers in conducting parameters quantification for other algorithms.
Genetic Algorithm for Grammar Induction and Rules Verification through a PDA Simulator Hari Mohan Pandey
IAES International Journal of Artificial Intelligence (IJ-AI) Vol 6, No 3: September 2017
Publisher : Institute of Advanced Engineering and Science

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (370.693 KB) | DOI: 10.11591/ijai.v6.i3.pp100-111

Abstract

The focus of this paper is towards developing a grammatical inference system uses a genetic algorithm (GA), has a powerful global exploration capability that can exploit the optimum offspring. The implemented system runs in two phases: first, generation of grammar rules and verification and then applies the GA’s operation to optimize the rules. A pushdown automata simulator has been developed, which parse the training data over the grammar’s rules. An inverted mutation with random mask and then ‘XOR’ operator has been applied introduces diversity in the population, helps the GA not to get trapped at local optimum. Taguchi method has been incorporated to tune the parameters makes the proposed approach more robust, statistically sound and quickly convergent. The performance of the proposed system has been compared with: classical GA, random offspring GA and crowding algorithms. Overall, a grammatical inference system has been developed that employs a PDA simulator for verification.

Page 1 of 1 | Total Record : 5